The resource constrained shortest path problemimplemented in a lazy functional

The resource constrained shortest path problemimplemented in

The Resource Constrained Shortest Path Problem Implemented in a Lazy Functional Language

The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in FORTRAN or another imperative programming language. We have implemented some of the simpler algorithms in a lazy functional language. Benefits accrue in the software engineering of the implementations. Our implementations have ...

Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths

Resource constrained shortest path problems are usually solved by label algorithms, which consist in a smart enumeration of the non-dominated paths. Recent improvements of these algorithms rely on the use of bounds on path resources to discard partial solutions. The quality of the bounds determines the performance of the algorithm. The main contribution of this paper is to introduce a standard ...

On Resource Constrained Optimization Problems

This paper shows that a method that has long been used to solve Resource Constrained Optimization Problems and found extremely effective in practice, is effective in the theoretical sense as well, it is proved to be strongly polynomial. In the special case of Resource Constrained Shortest Path Problem a better running time estimation is also presented.

Solving resource constrained shortest path problems with Branch-and-Cut

In the resource constrained shortest path problem (RCSPP) a shortest path satisfying additional resource bounds is sought. Each arc has a length and a resource usage vector specifying the requirements from each resource of a finite set of resources. The resource bounds limit the total usage along feasible paths for each resource type. In this paper we introduce new cutting planes, separation pr...